e ( , 3) was

oved d ago a y

o

t e ce (3, ).

e e o e t e

decomposition is shown below, where the residues on the right

bar was for the residues which were passed in the previous

d propagation steps

d(TGGC, TGC) = d(TGG, TG) + δ(C|T, C|T) = 1 + 0

ell (3, 2) was moved diagonally from the cell (2, 1). The distance

sition is shown below,

d(TGG, TG) = d(TG, T) + δ(G|CT, G|CT) = 1 + 0 = 1

ell (2, 1) was moved vertically from the cell (1, 1) with the

decomposition shown below,

d(TG, T) = d(T, T) + δ(G|GCT, െ|GCT) = 0 + 1

nal decomposition is shown below,

d(T, T) = d(െ,െ) + δ(T|GGCT, T|െGCT) = 0 + 0

nal optimal alignment is shown below, which had four matches,

match and one gap.

is no R package available for the Sellers algorithm. An R code

ller algorithm can be requested from the author via an email.

e Needleman-Wunsch algorithm

dleman-Wunsch alignment algorithm was also developed based

dynamic programming approach and is used for the global

y alignment as well [Needleman and Wunsch, 1970]. The

m employs a scoring approach, i.e., a match score is one, a

h score is zero and a gap score is zero as well. The algorithm has